Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 6, 2026 04:09Teow Hua JunTeow Hua JunScore: 11,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 04:0911,496105,043,03785,228,00010,189,0002,117,632stderr
2Jul 6, 2026 04:0911,523105,202,59685,139,00010,509,0002,117,632stderr
3Jul 6, 2026 04:0911,648106,737,74385,532,00011,149,0002,117,632stderr
4Jul 6, 2026 04:0911,663106,862,10385,788,00011,021,0002,117,632stderr
5Jul 6, 2026 04:0911,683107,074,37486,034,00010,939,0002,117,632stderr
6Jul 6, 2026 04:0911,703107,211,70486,194,00010,948,0002,117,632stderr
7Jul 6, 2026 04:0911,730107,517,63586,162,00011,200,0002,117,632stderr
8Jul 6, 2026 04:0911,742107,550,13486,929,00010,535,0002,117,632stderr
9Jul 6, 2026 04:0911,753107,623,41186,480,00011,074,0002,117,632stderr