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 29, 2026 03:11Josu San MartinJosu San MartinScore: 24,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:1124,401127,992,213118,315,0001,252,0002,113,536
2Aug 29, 2026 03:1124,403128,011,386118,313,0001,266,0002,113,536
3Aug 29, 2026 03:1124,408127,978,278118,363,0001,240,0002,113,536
4Aug 29, 2026 03:1124,411128,047,733118,357,0001,259,0002,113,536
5Aug 29, 2026 03:1124,416128,031,082118,393,0001,248,0002,113,536
6Aug 29, 2026 03:1124,416128,055,501118,392,0001,250,0002,113,536
7Aug 29, 2026 03:1124,464128,260,557118,865,0001,012,0002,113,536
8Aug 29, 2026 03:1124,465128,265,017118,619,0001,264,0002,113,536
9Aug 29, 2026 03:1124,468128,317,399118,653,0001,242,0002,113,536