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 4, 2026 03:37Josu San MartinJosu San MartinScore: 27,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 03:3827,347142,476,557132,754,0001,250,0002,113,536
2Aug 4, 2026 03:3827,351142,273,987132,745,0001,277,0002,113,536
3Aug 4, 2026 03:3827,359142,463,396132,814,0001,246,0002,113,536
4Aug 4, 2026 03:3827,365142,257,310132,833,0001,257,0002,113,536
5Aug 4, 2026 03:3827,374142,650,137132,871,0001,265,0002,113,536
6Aug 4, 2026 03:3827,387142,334,081132,940,0001,259,0002,113,536
7Aug 4, 2026 03:3827,396142,973,776133,226,0001,017,0002,113,536
8Aug 4, 2026 03:3827,417142,828,337133,086,0001,259,0002,113,536
9Aug 4, 2026 03:3827,460143,025,469133,507,0001,048,0002,113,536