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 listMar 19, 2026 20:34olliecrowolliecrowScore: 93,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 20:3493,695481,486,068459,105,00002,277,376
2Mar 19, 2026 20:3493,701482,452,681458,135,0001,000,0002,379,776
3Mar 19, 2026 20:3493,719481,500,383458,222,0001,000,0002,457,600
4Mar 19, 2026 20:3493,724481,275,767458,248,0001,000,0002,383,872
5Mar 19, 2026 20:3493,732482,375,015459,285,00002,457,600
6Mar 19, 2026 20:3493,750488,299,070459,374,00002,379,776
7Mar 19, 2026 20:3493,804482,788,856457,640,0001,998,0002,277,376
8Mar 19, 2026 20:3493,844484,937,109457,838,0001,999,0002,277,376
9Mar 19, 2026 20:3493,950495,912,155457,380,0002,976,0002,273,280