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 13, 2026 17:20Tomislav TunkovicTomislav TunkovicScore: 565,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 17:21564,1552,773,587,3152,763,356,0001,006,0002,121,728stderr
2Aug 13, 2026 17:21565,0332,784,308,0862,767,662,0001,003,0002,121,728stderr
3Aug 13, 2026 17:21565,0402,777,514,1052,766,682,0002,018,0002,121,728stderr
4Aug 13, 2026 17:21565,0582,778,304,9012,766,780,0002,007,0002,121,728stderr
5Aug 13, 2026 17:21565,0972,777,684,2932,767,978,0001,001,0002,121,728stderr
6Aug 13, 2026 17:21565,2642,778,446,9532,767,573,0002,225,0002,121,728stderr
7Aug 13, 2026 17:21565,4892,779,189,1092,769,894,0001,003,0002,121,728stderr
8Aug 13, 2026 17:21565,5332,780,374,6402,770,111,0001,004,0002,121,728stderr
9Aug 13, 2026 17:21565,7112,780,422,8362,770,960,0001,028,0002,121,728stderr