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 15:06Andrew EpsteinAndrew EpsteinScore: 211,672Success
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 15:07208,5201,033,145,1141,020,644,0001,105,0002,117,632stderr
2Sep 24, 2026 15:07211,5701,047,151,9421,035,579,0001,118,0002,117,632stderr
3Sep 24, 2026 15:07211,6011,047,384,4221,035,737,0001,111,0002,117,632stderr
4Sep 24, 2026 15:07211,6081,047,501,7131,035,761,0001,120,0002,117,632stderr
5Sep 24, 2026 15:07211,6721,047,768,8971,036,068,0001,129,0002,117,632stderr
6Sep 24, 2026 15:07211,6981,047,995,4501,035,196,0002,128,0002,117,632stderr
7Sep 24, 2026 15:07211,7011,047,944,6821,036,237,0001,102,0002,117,632stderr
8Sep 24, 2026 15:07211,7351,048,049,9031,036,381,0001,123,0002,117,632stderr
9Sep 24, 2026 15:07211,7691,048,517,4091,036,548,0001,121,0002,117,632stderr