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 14, 2026 00:30Jarry XiaoJarry XiaoScore: 11,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 00:3111,962108,975,70098,276,0001,011,0002,121,728stderr
2Jul 14, 2026 00:3111,965108,897,90798,301,0001,011,0002,121,728stderr
3Jul 14, 2026 00:3111,970108,902,62798,343,0001,011,0002,121,728stderr
4Jul 14, 2026 00:3111,976108,962,52798,394,0001,012,0002,121,728stderr
5Jul 14, 2026 00:3111,986109,117,65598,477,0001,012,0002,121,728stderr
6Jul 14, 2026 00:3112,001109,124,89898,595,0001,018,0002,121,728stderr
7Jul 14, 2026 00:3112,083109,933,14799,278,0001,011,0002,121,728stderr
8Jul 14, 2026 00:3112,083109,887,11999,277,0001,012,0002,121,728stderr
9Jul 14, 2026 00:3112,103110,168,76199,450,0001,011,0002,121,728stderr