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 listJan 23, 2026 18:23Josu San MartinJosu San MartinScore: 109,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 18:39109,538566,410,601533,738,0002,998,0002,392,064
2Jan 23, 2026 18:39109,563562,711,370534,861,0001,999,0002,269,184
3Jan 23, 2026 18:39109,588563,063,515533,982,0002,999,0002,273,280
4Jan 23, 2026 18:23109,594566,701,881535,013,0002,000,0002,400,256
5Jan 23, 2026 18:23109,695569,658,272534,509,0002,997,0002,269,184
6Jan 23, 2026 18:23114,055583,996,073556,871,0001,999,0002,269,184