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 18, 2026 01:26Josu San MartinJosu San MartinScore: 25,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 01:3425,425133,094,309122,553,0002,030,0002,138,112
2Aug 18, 2026 01:3425,429133,254,738123,434,0001,172,0002,138,112
3Aug 18, 2026 01:3425,429133,035,545123,441,0001,163,0002,138,112
4Aug 18, 2026 01:3425,436133,124,484123,475,0001,164,0002,138,112
5Aug 18, 2026 01:3425,450133,074,482123,401,0001,308,0002,138,112
6Aug 18, 2026 01:3425,465133,234,872123,619,0001,163,0002,138,112
7Aug 18, 2026 01:3425,481133,322,273122,690,0002,168,0002,138,112
8Aug 18, 2026 01:3425,512133,468,462123,852,0001,159,0002,138,112
9Aug 18, 2026 01:3425,513133,427,658122,934,0002,082,0002,138,112