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 1, 2026 20:49CodeReclaimersCodeReclaimersScore: 87,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 20:5086,536434,203,175422,911,0001,119,0002,113,536
2Aug 1, 2026 20:5086,670435,623,894423,577,0001,110,0002,113,536
3Aug 1, 2026 20:5087,070436,700,232425,552,0001,093,0002,113,536
4Aug 1, 2026 20:5087,081436,754,458425,599,0001,100,0002,113,536
5Aug 1, 2026 20:5087,093438,280,619425,640,0001,117,0002,113,536
6Aug 1, 2026 20:5087,198437,439,733426,165,0001,108,0002,113,536
7Aug 1, 2026 20:5087,230437,484,576426,321,0001,106,0002,113,536
8Aug 1, 2026 20:5087,562439,947,007427,940,0001,117,0002,113,536
9Aug 1, 2026 20:5087,786440,314,513429,027,0001,125,0002,113,536