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 4, 2026 08:52Josu San MartinJosu San MartinScore: 27,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 08:5627,109142,561,501130,549,0002,288,0002,129,920
2Aug 4, 2026 08:5627,131142,744,029130,827,0002,118,0002,129,920
3Aug 4, 2026 08:5627,155143,191,488130,767,0002,295,0002,174,976
4Aug 4, 2026 08:5627,164142,773,387131,053,0002,053,0002,129,920
5Aug 4, 2026 08:5627,182147,731,810131,155,0002,039,0002,129,920
6Aug 4, 2026 08:5627,197145,033,338131,236,0002,034,0002,134,016
7Aug 4, 2026 08:5627,219143,581,253131,290,0002,085,0002,129,920
8Aug 4, 2026 08:5627,264153,151,926131,563,0002,033,0002,129,920
9Aug 4, 2026 08:5627,407144,064,530132,268,0002,028,0002,129,920