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:36Josu San MartinJosu San MartinScore: 25,291Success
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:3725,230132,672,583122,383,0001,244,0002,113,536
2Aug 4, 2026 15:3725,238132,723,754122,395,0001,273,0002,113,536
3Aug 4, 2026 15:3725,273132,249,485122,583,0001,255,0002,113,536
4Aug 4, 2026 15:3725,276132,188,860122,602,0001,251,0002,113,536
5Aug 4, 2026 15:3725,291132,840,968122,659,0001,270,0002,113,536
6Aug 4, 2026 15:3725,316132,472,858122,804,0001,247,0002,113,536
7Aug 4, 2026 15:3725,320132,439,505122,823,0001,246,0002,113,536
8Aug 4, 2026 15:3725,347132,650,961122,947,0001,257,0002,113,536
9Aug 4, 2026 15:3725,871135,817,272125,738,0001,033,0002,113,536