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 28, 2026 21:13Josu San MartinJosu San MartinScore: 25,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 21:1325,366132,767,071123,033,0001,264,0002,113,536
2Aug 28, 2026 21:1325,377132,753,309123,105,0001,246,0002,113,536
3Aug 28, 2026 21:1325,407132,887,509123,248,0001,247,0002,113,536
4Aug 28, 2026 21:1325,442132,994,667123,557,0001,109,0002,113,536
5Aug 28, 2026 21:1325,444133,075,211123,426,0001,250,0002,113,536
6Aug 28, 2026 21:1325,453133,163,330123,459,0001,262,0002,113,536
7Aug 28, 2026 21:1325,458133,285,666123,484,0001,264,0002,113,536
8Aug 28, 2026 21:1326,510138,285,946128,722,0001,181,0002,113,536
9Aug 28, 2026 21:1328,559148,377,869138,684,0001,256,0002,113,536