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 listApr 13, 2026 10:30wnwnScore: 4,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 10:304,13656,560,16033,321,0001,009,0002,498,560
2Apr 13, 2026 10:304,14054,393,77033,349,0001,010,0002,531,328
3Apr 13, 2026 10:304,14859,393,13733,419,0001,012,0002,490,368
4Apr 13, 2026 10:304,15456,703,55133,463,0001,014,0002,277,376
5Apr 13, 2026 10:304,17160,845,18733,598,0001,018,0002,490,368
6Apr 13, 2026 10:304,26356,463,87234,373,0001,010,0002,277,376
7Apr 13, 2026 10:304,29359,054,12934,618,0001,018,0002,498,560
8Apr 13, 2026 10:304,31260,486,58133,800,0001,988,0002,498,560
9Apr 13, 2026 10:304,32361,091,38833,890,0001,993,0002,277,376