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 listMar 14, 2026 16:31wnwnScore: 4,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 16:294,40561,684,63235,550,0001,015,0002,498,560
2Mar 14, 2026 16:314,40758,244,40235,564,0001,016,0002,273,280
3Mar 14, 2026 16:284,40961,166,38935,581,0001,016,0002,486,272
4Mar 14, 2026 16:284,41163,107,39035,596,0001,017,0002,494,464
5Mar 14, 2026 16:284,41262,765,82135,602,0001,017,0002,531,328
6Mar 14, 2026 16:284,41571,249,38035,628,0001,017,0002,273,280
7Mar 14, 2026 16:294,41864,857,87535,650,0001,018,0002,273,280
8Mar 14, 2026 16:314,43765,207,38834,833,0001,990,0002,494,464
9Mar 14, 2026 16:294,44661,201,52534,910,0001,994,0002,273,280
10Mar 14, 2026 16:314,45454,824,35934,974,0001,998,0002,531,328
11Mar 14, 2026 16:284,47459,986,07035,130,0002,007,0002,494,464
12Mar 14, 2026 16:284,47959,495,92235,163,0002,009,0002,498,560