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 listMay 17, 2026 19:22user76135user76135Score: 111,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 19:24110,820929,846,246688,632,000231,181,0002,113,536
2May 17, 2026 19:24110,992933,511,424687,250,000233,984,0002,113,536
3May 17, 2026 19:24111,318934,854,627690,040,000233,900,0002,113,536
4May 17, 2026 19:24111,442935,465,001691,314,000233,658,0002,113,536
5May 17, 2026 19:24111,548936,430,969691,579,000234,273,0002,113,536
6May 17, 2026 19:24111,561935,901,686690,555,000235,407,0002,113,536
7May 17, 2026 19:24111,698938,094,917689,642,000237,456,0002,113,536
8May 17, 2026 19:24111,940939,196,151691,462,000237,640,0002,113,536
9May 17, 2026 19:24112,061941,823,250689,259,000240,852,0002,113,536