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 listAug 4, 2026 17:57Josu San MartinJosu San MartinScore: 25,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 17:5825,150132,234,187121,955,0001,280,0002,113,536
2Aug 4, 2026 17:5825,151131,840,841122,227,0001,015,0002,113,536
3Aug 4, 2026 17:5825,166131,692,304122,060,0001,254,0002,113,536
4Aug 4, 2026 17:5825,185141,903,233122,364,0001,046,0002,113,536
5Aug 4, 2026 17:5825,207131,954,973122,262,0001,257,0002,113,536
6Aug 4, 2026 17:5825,209131,987,501122,272,0001,256,0002,113,536
7Aug 4, 2026 17:5825,217132,657,252122,291,0001,275,0002,113,536
8Aug 4, 2026 17:5825,256132,162,737122,665,0001,092,0002,113,536
9Aug 4, 2026 17:5825,426133,002,462123,329,0001,259,0002,113,536