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 6, 2026 03:31CheckHarryCheckHarryScore: 3,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:313,92942,446,36031,604,0001,008,0002,113,536
2Sep 6, 2026 03:313,93442,560,18831,627,0001,028,0002,113,536
3Sep 6, 2026 03:313,93742,635,23831,640,0001,043,0002,113,536
4Sep 6, 2026 03:313,96642,793,86131,722,0001,197,0002,113,536
5Sep 6, 2026 03:313,97142,832,22031,763,0001,198,0002,113,536
6Sep 6, 2026 03:313,97342,881,17231,959,0001,018,0002,113,536
7Sep 6, 2026 03:314,09043,760,73532,942,0001,011,0002,113,536
8Sep 6, 2026 03:314,10443,918,87233,056,0001,009,0002,113,536
9Sep 6, 2026 03:314,16855,049,94633,518,0001,079,0002,113,536