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 11:21Josu San MartinJosu San MartinScore: 35,193Success
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 11:2235,158182,435,904171,161,0001,117,0002,113,536
2Aug 1, 2026 11:2235,182182,541,881171,265,0001,128,0002,113,536
3Aug 1, 2026 11:2235,185182,480,536171,310,0001,098,0002,113,536
4Aug 1, 2026 11:2235,185182,503,026171,308,0001,101,0002,113,536
5Aug 1, 2026 11:2235,193182,421,202171,337,0001,112,0002,113,536
6Aug 1, 2026 11:2235,211182,588,641171,404,0001,131,0002,113,536
7Aug 1, 2026 11:2235,211182,708,919171,397,0001,137,0002,113,536
8Aug 1, 2026 11:2235,213183,405,308171,435,0001,109,0002,113,536
9Aug 1, 2026 11:2235,216183,938,094171,433,0001,127,0002,113,536