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 listFeb 25, 2026 19:02Ropi777Ropi777Score: 72,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 19:0272,083627,814,599544,266,00054,026,0002,375,680
2Feb 25, 2026 19:0272,094626,916,505544,347,00054,034,0002,277,376
3Feb 25, 2026 19:0272,130622,142,049548,706,00049,973,0002,269,184
4Feb 25, 2026 19:0272,132619,620,861541,728,00056,971,0002,277,376
5Feb 25, 2026 19:0272,171624,099,575547,020,00052,001,0002,277,376
6Feb 25, 2026 19:0272,182619,947,900544,098,00055,009,0002,498,560
7Feb 25, 2026 19:0272,207624,802,230559,296,00040,021,0002,273,280
8Feb 25, 2026 19:0272,371626,266,745554,701,00045,975,0002,277,376
9Feb 25, 2026 19:0272,511627,748,929543,856,00057,984,0002,277,376