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 03:37CheckHarryCheckHarryScore: 9,084Success
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 03:389,06985,124,57374,101,0001,176,0002,113,536
2Sep 3, 2026 03:389,07785,136,53274,165,0001,175,0002,113,536
3Sep 3, 2026 03:389,08285,314,07474,331,0001,052,0002,113,536
4Sep 3, 2026 03:389,08385,280,87674,349,0001,041,0002,113,536
5Sep 3, 2026 03:389,08485,279,11074,335,0001,065,0002,113,536
6Sep 3, 2026 03:389,08685,279,19174,373,0001,041,0002,113,536
7Sep 3, 2026 03:389,14385,677,32174,835,0001,052,0002,113,536
8Sep 3, 2026 03:389,17986,047,80575,004,0001,182,0002,113,536
9Sep 3, 2026 03:389,26086,892,73275,671,0001,189,0002,113,536