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 25, 2026 10:44Victor MerckléVictor MerckléScore: 42,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 10:4542,246216,021,715205,986,0001,021,0002,117,632stderr
2Aug 25, 2026 10:4542,266216,186,545206,005,0001,102,0002,117,632stderr
3Aug 25, 2026 10:4542,278216,338,486206,063,0001,103,0002,117,632stderr
4Aug 25, 2026 10:4542,279216,083,014206,017,0001,151,0002,117,632stderr
5Aug 25, 2026 10:4542,281216,200,936206,082,0001,096,0002,117,632stderr
6Aug 25, 2026 10:4542,285216,180,767206,087,0001,114,0002,117,632stderr
7Aug 25, 2026 10:4542,290216,201,540206,117,0001,105,0002,117,632stderr
8Aug 25, 2026 10:4542,294216,284,824206,149,0001,095,0002,117,632stderr
9Aug 25, 2026 10:4542,295217,595,572206,108,0001,142,0002,117,632stderr