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 listSep 3, 2026 10:37boop34boop34Score: 9,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 10:389,11785,745,64274,617,0001,062,0002,113,536
2Sep 3, 2026 10:389,14685,992,83074,863,0001,052,0002,113,536
3Sep 3, 2026 10:389,17486,195,09775,113,0001,039,0002,113,536
4Sep 3, 2026 10:389,17986,300,54775,106,0001,087,0002,113,536
5Sep 3, 2026 10:389,18087,035,20975,144,0001,057,0002,113,536
6Sep 3, 2026 10:389,18486,259,56475,197,0001,037,0002,113,536
7Sep 3, 2026 10:389,18986,394,05875,231,0001,045,0002,113,536
8Sep 3, 2026 10:389,19586,384,55375,292,0001,033,0002,113,536
9Sep 3, 2026 10:389,42988,351,52277,190,0001,074,0002,113,536