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 2, 2026 18:04CheckHarryCheckHarryScore: 6,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 18:086,00359,680,61148,782,0001,047,0002,113,536
2Sep 2, 2026 18:086,00559,581,71648,806,0001,043,0002,113,536
3Sep 2, 2026 18:086,00759,712,77148,821,0001,045,0002,113,536
4Sep 2, 2026 18:086,00859,823,71948,832,0001,042,0002,113,536
5Sep 2, 2026 18:086,00859,704,06648,689,0001,180,0002,113,536
6Sep 2, 2026 18:086,01159,761,50448,843,0001,053,0002,113,536
7Sep 2, 2026 18:086,01159,766,16748,838,0001,055,0002,113,536
8Sep 2, 2026 18:086,01359,755,16848,869,0001,041,0002,113,536
9Sep 2, 2026 18:086,02859,879,37948,986,0001,048,0002,113,536