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 24, 2026 14:38TudyMTudyMScore: 50,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 14:3850,055437,098,060411,470,0003,994,0002,473,984
2Apr 24, 2026 14:3850,098432,876,294413,818,0001,999,0002,461,696
3Apr 24, 2026 14:3850,133431,515,560413,107,0003,000,0002,465,792
4Apr 24, 2026 14:3850,135434,304,700415,125,0001,000,0002,461,696
5Apr 24, 2026 14:3850,160435,789,452413,331,0003,002,0002,469,888
6Apr 24, 2026 14:3850,170435,222,372415,413,0001,000,0002,457,600
7Apr 24, 2026 14:3850,173435,879,833413,440,0003,003,0002,465,792
8Apr 24, 2026 14:3850,174435,648,957415,445,0001,003,0002,457,600
9Apr 24, 2026 14:3850,175432,636,991414,461,0001,997,0002,465,792