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 21:39anboto1anboto1Score: 57,808Success
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 21:4157,565290,527,844280,948,0001,121,0002,113,536
2Aug 3, 2026 21:4157,648291,647,953281,209,0001,267,0002,113,536
3Aug 3, 2026 21:4157,711291,836,205281,672,0001,113,0002,113,536
4Aug 3, 2026 21:4157,785292,288,982282,016,0001,131,0002,113,536
5Aug 3, 2026 21:4157,808292,542,820282,132,0001,130,0002,113,536
6Aug 3, 2026 21:4157,881292,815,267282,511,0001,108,0002,113,536
7Aug 3, 2026 21:4158,032293,477,329283,232,0001,128,0002,113,536
8Aug 3, 2026 21:4158,041292,892,160283,277,0001,125,0002,113,536
9Aug 3, 2026 21:4158,714296,788,354286,500,0001,200,0002,113,536