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 11, 2026 15:50wnwnScore: 3,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:503,28536,689,12426,233,0001,035,0002,113,536
2May 11, 2026 15:503,28936,723,19727,303,00002,113,536
3May 11, 2026 15:503,29237,224,48327,324,00002,113,536
4May 11, 2026 15:503,29336,880,01226,333,0001,004,0002,113,536
5May 11, 2026 15:503,29637,705,68127,364,00002,113,536
6May 11, 2026 15:503,29734,900,79727,372,00002,113,536
7May 11, 2026 15:503,29935,630,57527,386,00002,113,536
8May 11, 2026 15:503,31236,078,79826,414,0001,077,0002,113,536
9May 11, 2026 15:503,36838,218,96026,955,0001,005,0002,113,536