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 12:36Josu San MartinJosu San MartinScore: 25,443Success
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 12:3725,401132,784,395123,462,0001,006,0002,113,536
2Aug 4, 2026 12:3725,403133,417,244123,463,0001,014,0002,113,536
3Aug 4, 2026 12:3725,405133,558,922123,221,0001,268,0002,113,536
4Aug 4, 2026 12:3725,408133,515,920123,250,0001,250,0002,113,536
5Aug 4, 2026 12:3725,443132,885,651123,671,0001,003,0002,113,536
6Aug 4, 2026 12:3725,471133,161,712123,552,0001,259,0002,113,536
7Aug 4, 2026 12:3725,477133,809,484123,575,0001,264,0002,113,536
8Aug 4, 2026 12:3725,480133,159,428123,592,0001,263,0002,113,536
9Aug 4, 2026 12:3727,435143,340,515133,187,0001,249,0002,113,536