Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listJul 31, 2026 19:34anboto1anboto1Score: 156,777Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:35153,917765,114,182752,174,0002,023,0002,113,536
2Jul 31, 2026 19:35155,060770,403,327757,748,0002,048,0002,113,536
3Jul 31, 2026 19:35155,183770,488,546758,386,0002,011,0002,113,536
4Jul 31, 2026 19:35155,712773,189,800760,711,0002,278,0002,113,536
5Jul 31, 2026 19:35156,777778,265,258765,971,0002,237,0002,113,536
6Jul 31, 2026 19:35156,804778,391,911766,160,0002,180,0002,113,536
7Jul 31, 2026 19:35157,416781,265,725769,119,0002,223,0002,113,536
8Jul 31, 2026 19:35157,565783,423,960768,818,0003,253,0002,113,536
9Jul 31, 2026 19:35158,090784,577,192772,468,0002,176,0002,113,536