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 2, 2026 16:50Josu San MartinJosu San MartinScore: 29,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 16:5029,764156,518,330144,726,0001,120,0002,113,536
2Aug 2, 2026 16:5029,772156,716,053144,752,0001,133,0002,113,536
3Aug 2, 2026 16:5029,773156,693,434144,752,0001,139,0002,113,536
4Aug 2, 2026 16:5029,791155,979,050144,850,0001,129,0002,113,536
5Aug 2, 2026 16:5029,803156,075,420144,933,0001,105,0002,113,536
6Aug 2, 2026 16:5029,815156,219,517144,981,0001,113,0002,113,536
7Aug 2, 2026 16:5030,043157,280,935146,087,0001,125,0002,113,536
8Aug 2, 2026 16:5030,054158,058,770146,133,0001,135,0002,113,536
9Aug 2, 2026 16:5031,657165,148,068153,994,0001,126,0002,113,536