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 listMay 9, 2026 23:46Josu San MartinJosu San MartinScore: 5,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:464,85354,867,10539,073,0001,215,0002,379,776
2May 9, 2026 23:464,89056,329,38539,291,0001,303,0002,375,680
3May 9, 2026 23:464,90855,255,64039,682,0001,055,0002,379,776
4May 9, 2026 23:465,05358,373,57040,905,0001,040,0002,371,584
5May 9, 2026 23:465,05960,659,65840,953,0001,039,0002,371,584
6May 9, 2026 23:465,06957,249,47141,025,0001,052,0002,367,488
7May 9, 2026 23:465,12060,792,59241,462,0001,041,0002,367,488
8May 9, 2026 23:465,12356,218,04341,490,0001,031,0002,371,584
9May 9, 2026 23:465,22160,256,47842,290,0001,049,0002,383,872