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 00:22Josu San MartinJosu San MartinScore: 32,192Success
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 00:2332,150168,038,216156,286,0001,253,0002,113,536
2Aug 3, 2026 00:2332,154166,038,890156,551,0001,008,0002,113,536
3Aug 3, 2026 00:2332,179166,801,040156,647,0001,034,0002,113,536
4Aug 3, 2026 00:2332,181165,897,021156,668,0001,019,0002,113,536
5Aug 3, 2026 00:2332,192166,169,643156,479,0001,264,0002,113,536
6Aug 3, 2026 00:2332,223166,370,263156,619,0001,275,0002,113,536
7Aug 3, 2026 00:2332,356167,032,211157,528,0001,018,0002,113,536
8Aug 3, 2026 00:2335,328181,562,384171,843,0001,267,0002,113,536
9Aug 3, 2026 00:2336,966189,582,028180,103,0001,033,0002,113,536