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 22:23Josu San MartinJosu San MartinScore: 29,595Success
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 22:2429,562154,854,468143,731,0001,126,0002,113,536
2Aug 2, 2026 22:2429,564155,040,365143,754,0001,112,0002,113,536
3Aug 2, 2026 22:2429,575155,677,686143,764,0001,155,0002,113,536
4Aug 2, 2026 22:2429,589155,750,034143,850,0001,140,0002,113,536
5Aug 2, 2026 22:2429,595155,469,737143,877,0001,139,0002,113,536
6Aug 2, 2026 22:2429,599155,062,277143,917,0001,122,0002,113,536
7Aug 2, 2026 22:2429,611155,945,881143,973,0001,123,0002,113,536
8Aug 2, 2026 22:2429,667156,019,082144,123,0001,247,0002,113,536
9Aug 2, 2026 22:2429,771155,856,496144,758,0001,123,0002,113,536