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:22CheckHarryCheckHarryScore: 6,417Success
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:236,38662,767,77551,843,0001,166,0002,113,536
2Sep 2, 2026 18:236,39562,896,39651,921,0001,165,0002,113,536
3Sep 2, 2026 18:236,39562,963,09551,909,0001,176,0002,113,536
4Sep 2, 2026 18:236,39562,892,88551,912,0001,173,0002,113,536
5Sep 2, 2026 18:236,41763,219,43152,096,0001,168,0002,113,536
6Sep 2, 2026 18:236,41963,135,25652,128,0001,157,0002,113,536
7Sep 2, 2026 18:236,42063,141,62552,126,0001,166,0002,113,536
8Sep 2, 2026 18:236,42163,145,20752,120,0001,175,0002,113,536
9Sep 2, 2026 18:236,42563,155,36452,165,0001,166,0002,113,536