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 5, 2026 17:56CheckHarryCheckHarryScore: 4,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 17:574,19844,759,49033,829,0001,016,0002,113,536
2Sep 5, 2026 17:574,22146,128,69734,020,0001,018,0002,113,536
3Sep 5, 2026 17:574,22244,875,91834,026,0001,018,0002,113,536
4Sep 5, 2026 17:574,22644,938,25934,062,0001,018,0002,113,536
5Sep 5, 2026 17:574,25545,165,28134,144,0001,173,0002,113,536
6Sep 5, 2026 17:574,34045,953,00234,998,0001,027,0002,113,536
7Sep 5, 2026 17:574,35646,295,59935,142,0001,016,0002,113,536
8Sep 5, 2026 17:574,37246,132,02635,275,0001,016,0002,113,536
9Sep 5, 2026 17:574,38346,237,01735,363,0001,017,0002,113,536