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 15:41Josu San MartinJosu San MartinScore: 25,186Success
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 15:4125,173132,432,448122,084,0001,265,0002,113,536
2Aug 4, 2026 15:4125,176131,783,982122,234,0001,130,0002,113,536
3Aug 4, 2026 15:4125,178132,442,694122,355,0001,020,0002,113,536
4Aug 4, 2026 15:4125,178132,398,729122,119,0001,256,0002,113,536
5Aug 4, 2026 15:4125,186132,539,465122,163,0001,251,0002,113,536
6Aug 4, 2026 15:4125,206131,965,934122,235,0001,277,0002,113,536
7Aug 4, 2026 15:4125,214131,994,238122,467,0001,085,0002,113,536
8Aug 4, 2026 15:4125,230132,619,724122,378,0001,252,0002,113,536
9Aug 4, 2026 15:4125,237132,121,104122,651,0001,013,0002,113,536