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 15:08Josu San MartinJosu San MartinScore: 25,239Success
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 15:0825,152131,832,806121,993,0001,256,0002,113,536
2Aug 4, 2026 15:0825,156131,710,776122,013,0001,256,0002,113,536
3Aug 4, 2026 15:0825,190131,832,562122,181,0001,251,0002,113,536
4Aug 4, 2026 15:0825,193131,986,328122,172,0001,275,0002,113,536
5Aug 4, 2026 15:0825,239131,989,781122,428,0001,245,0002,113,536
6Aug 4, 2026 15:0825,250133,510,497122,468,0001,259,0002,113,536
7Aug 4, 2026 15:0825,515136,500,809124,002,0001,022,0002,113,536
8Aug 4, 2026 15:0825,602133,674,072124,181,0001,272,0002,113,536
9Aug 4, 2026 15:0825,644134,148,460124,629,0001,030,0002,113,536