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 3, 2026 20:50anboto1anboto1Score: 68,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:5367,843341,537,449331,260,0001,172,0002,113,536
2Aug 3, 2026 20:5367,874341,586,086331,419,0001,168,0002,113,536
3Aug 3, 2026 20:5367,911341,864,450331,608,0001,157,0002,113,536
4Aug 3, 2026 20:5367,917341,899,696331,702,0001,094,0002,113,536
5Aug 3, 2026 20:5368,013342,315,078332,168,0001,099,0002,113,536
6Aug 3, 2026 20:5368,172343,262,118331,999,0002,044,0002,113,536
7Aug 3, 2026 20:5368,233343,354,489333,251,0001,094,0002,113,536
8Aug 3, 2026 20:5368,313343,876,599333,640,0001,096,0002,113,536
9Aug 3, 2026 20:5371,591359,792,081349,700,0001,096,0002,113,536