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:03anboto1anboto1Score: 57,722Success
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:0557,578291,180,522281,043,0001,093,0002,113,536
2Aug 3, 2026 21:0557,625291,435,515281,211,0001,154,0002,113,536
3Aug 3, 2026 21:0557,651292,332,526281,336,0001,157,0002,113,536
4Aug 3, 2026 21:0557,664291,657,316281,463,0001,093,0002,113,536
5Aug 3, 2026 21:0557,722291,800,551281,724,0001,115,0002,113,536
6Aug 3, 2026 21:0557,820291,952,957282,145,0001,176,0002,113,536
7Aug 3, 2026 21:0557,891292,097,740282,577,0001,093,0002,113,536
8Aug 3, 2026 21:0559,097298,670,885288,483,0001,097,0002,113,536
9Aug 3, 2026 21:0559,107298,735,797288,413,0001,214,0002,113,536