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 14:44Josu San MartinJosu San MartinScore: 31,004Success
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 14:4430,967161,774,581150,634,0001,108,0002,113,536
2Aug 2, 2026 14:4430,968165,026,543150,627,0001,117,0002,113,536
3Aug 2, 2026 14:4430,971162,114,181150,649,0001,111,0002,113,536
4Aug 2, 2026 14:4430,985161,862,835150,702,0001,125,0002,113,536
5Aug 2, 2026 14:4431,004161,955,224150,800,0001,122,0002,113,536
6Aug 2, 2026 14:4431,008161,894,339150,830,0001,113,0002,113,536
7Aug 2, 2026 14:4431,013161,964,798150,859,0001,108,0002,113,536
8Aug 2, 2026 14:4431,018162,676,819150,864,0001,129,0002,113,536
9Aug 2, 2026 14:4431,032162,827,446150,753,0001,307,0002,113,536