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 2, 2026 20:17Josu San MartinJosu San MartinScore: 29,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:1729,753156,613,906144,652,0001,140,0002,113,536
2Aug 2, 2026 20:1729,759158,611,505144,699,0001,123,0002,113,536
3Aug 2, 2026 20:1729,767156,657,141144,723,0001,138,0002,113,536
4Aug 2, 2026 20:1729,767155,970,034144,739,0001,122,0002,113,536
5Aug 2, 2026 20:1729,774156,704,970144,763,0001,134,0002,113,536
6Aug 2, 2026 20:1729,775155,872,521144,777,0001,121,0002,113,536
7Aug 2, 2026 20:1729,807156,027,284144,917,0001,139,0002,113,536
8Aug 2, 2026 20:1729,912156,610,399145,451,0001,118,0002,113,536
9Aug 2, 2026 20:1729,918156,713,208145,463,0001,140,0002,113,536