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 listFeb 21, 2026 21:21wnwnScore: 5,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 22:424,99264,437,87240,427,0001,010,0002,277,376
2Feb 21, 2026 22:425,00266,255,87640,507,0001,012,0002,490,368
3Feb 21, 2026 21:215,01275,615,75840,588,0001,014,0002,277,376
4Feb 21, 2026 22:465,02375,393,64740,675,0001,016,0002,494,464
5Feb 21, 2026 22:425,03970,464,13339,832,0001,991,0002,277,376
6Feb 21, 2026 22:465,03972,192,03640,832,000995,0002,277,376
7Feb 21, 2026 22:425,04068,054,71739,838,0001,991,0002,277,376
8Feb 21, 2026 21:215,06168,861,49140,006,0002,000,0002,277,376
9Feb 21, 2026 22:425,06270,155,37540,016,0002,000,0002,277,376
10Feb 21, 2026 22:425,08166,658,06440,168,0002,008,0002,486,272
11Feb 21, 2026 21:215,09562,041,40941,283,0001,006,0002,277,376
12Feb 21, 2026 22:465,15970,934,51540,828,0001,991,0002,486,272