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 listSep 24, 2026 19:04Andrew EpsteinAndrew EpsteinScore: 40,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:0540,339208,082,837196,543,0001,119,0002,117,632stderr
2Sep 24, 2026 19:0540,348208,237,453196,598,0001,110,0002,117,632stderr
3Sep 24, 2026 19:0540,376209,040,990196,719,0001,125,0002,117,632stderr
4Sep 24, 2026 19:0540,380208,357,374196,748,0001,115,0002,117,632stderr
5Sep 24, 2026 19:0540,394208,397,649196,804,0001,131,0002,117,632stderr
6Sep 24, 2026 19:0540,404208,609,908196,854,0001,130,0002,117,632stderr
7Sep 24, 2026 19:0540,423209,201,949196,951,0001,124,0002,117,632stderr
8Sep 24, 2026 19:0540,423209,159,874196,951,0001,123,0002,117,632stderr
9Sep 24, 2026 19:0540,433209,417,288197,017,0001,108,0002,117,632stderr