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 2, 2026 11:29Josu San MartinJosu San MartinScore: 31,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:3231,057162,214,095151,057,0001,127,0002,113,536
2Aug 2, 2026 11:3231,061162,132,834151,066,0001,133,0002,113,536
3Aug 2, 2026 11:3231,067162,456,401151,109,0001,122,0002,113,536
4Aug 2, 2026 11:3231,076162,959,443151,166,0001,110,0002,113,536
5Aug 2, 2026 11:3231,088162,359,079151,218,0001,117,0002,113,536
6Aug 2, 2026 11:3231,101162,393,917151,273,0001,126,0002,113,536
7Aug 2, 2026 11:3231,293163,349,089152,224,0001,113,0002,113,536
8Aug 2, 2026 11:3231,379164,585,854152,632,0001,127,0002,113,536
9Aug 2, 2026 11:3232,200167,737,282156,684,0001,100,0002,113,536