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 22:03Josu San MartinJosu San MartinScore: 5,394Success
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 22:035,34561,720,18142,144,0002,221,0002,469,888
2May 9, 2026 22:035,34762,627,53642,144,0002,243,0002,457,600
3May 9, 2026 22:035,35759,964,90942,285,0002,180,0002,469,888
4May 9, 2026 22:035,37160,218,13042,395,0002,192,0002,465,792
5May 9, 2026 22:035,39461,083,58342,568,0002,204,0002,465,792
6May 9, 2026 22:035,46064,686,98843,095,0002,227,0002,469,888
7May 9, 2026 22:035,51660,533,51243,602,0002,184,0002,465,792
8May 9, 2026 22:035,53561,620,18643,746,0002,200,0002,453,504
9May 9, 2026 22:035,55572,509,22543,901,0002,208,0002,453,504