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 listSep 4, 2026 00:55Victor MerckléVictor MerckléScore: 26,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 00:5626,340137,481,356128,038,0001,028,0002,117,632stderr
2Sep 4, 2026 00:5626,350137,556,602128,019,0001,100,0002,117,632stderr
3Sep 4, 2026 00:5626,353137,590,169128,031,0001,100,0002,117,632stderr
4Sep 4, 2026 00:5626,374137,656,555128,132,0001,104,0002,117,632stderr
5Sep 4, 2026 00:5626,377137,696,496128,151,0001,101,0002,117,632stderr
6Sep 4, 2026 00:5626,392137,812,997128,234,0001,089,0002,117,632stderr
7Sep 4, 2026 00:5626,396137,848,673128,230,0001,113,0002,117,632stderr
8Sep 4, 2026 00:5626,404137,813,650128,276,0001,105,0002,117,632stderr
9Sep 4, 2026 00:5626,404137,814,121128,278,0001,106,0002,117,632stderr