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 16:16Josu San MartinJosu San MartinScore: 30,034Success
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 16:1629,967156,879,076145,713,0001,128,0002,113,536
2Aug 2, 2026 16:1629,970157,768,547145,724,0001,129,0002,113,536
3Aug 2, 2026 16:1629,973156,937,734145,738,0001,131,0002,113,536
4Aug 2, 2026 16:1630,010157,121,412145,766,0001,285,0002,113,536
5Aug 2, 2026 16:1630,034157,186,861146,056,0001,111,0002,113,536
6Aug 2, 2026 16:1630,238158,954,189147,030,0001,139,0002,113,536
7Aug 2, 2026 16:1630,251158,163,490147,117,0001,114,0002,113,536
8Aug 2, 2026 16:1630,258158,328,429147,112,0001,154,0002,113,536
9Aug 2, 2026 16:1630,493159,385,495148,300,0001,116,0002,113,536