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 15:31CheckHarryCheckHarryScore: 4,269Success
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 15:324,20644,690,76533,889,0001,026,0002,113,536
2Sep 3, 2026 15:324,20744,805,97933,895,0001,024,0002,113,536
3Sep 3, 2026 15:324,21344,845,50633,943,0001,031,0002,113,536
4Sep 3, 2026 15:324,21744,857,62733,972,0001,030,0002,113,536
5Sep 3, 2026 15:324,26947,179,24734,418,0001,018,0002,113,536
6Sep 3, 2026 15:324,29145,499,23234,602,0001,017,0002,113,536
7Sep 3, 2026 15:324,32345,749,60534,872,0001,017,0002,113,536
8Sep 3, 2026 15:324,34945,907,08135,086,0001,017,0002,113,536
9Sep 3, 2026 15:324,35645,963,81635,141,0001,017,0002,113,536