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 listJan 23, 2026 02:11Josu San MartinJosu San MartinScore: 113,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 02:11113,230581,568,200552,827,0001,999,0002,502,656
2Jan 23, 2026 02:11113,247580,470,043551,912,0002,999,0002,506,752
3Jan 23, 2026 02:11113,264576,744,623553,995,000999,0002,281,472
4Jan 23, 2026 02:11113,281583,334,962552,075,0003,000,0002,281,472
5Jan 23, 2026 02:11113,297581,063,182552,156,0003,000,0002,281,472
6Jan 23, 2026 02:11113,320579,517,185554,269,0001,000,0002,498,560
7Jan 23, 2026 02:11113,378586,572,324551,557,0003,996,0002,281,472
8Jan 23, 2026 02:11113,383584,277,332551,579,0003,996,0002,502,656
9Jan 23, 2026 02:11113,391581,404,396552,620,0002,997,0002,506,752