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 15, 2026 22:30wnwnScore: 11,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:309,129102,425,28567,793,0007,975,0002,297,856
2Feb 15, 2026 22:309,21697,141,80369,451,0007,045,0002,465,792
3Feb 15, 2026 22:309,331102,734,80370,404,0007,040,0002,498,560
4Feb 15, 2026 22:3011,033118,141,47684,534,0007,044,0002,269,184
5Feb 15, 2026 22:3011,088116,986,64782,031,00010,003,0002,465,792
6Feb 15, 2026 22:3011,346115,587,96886,154,0008,014,0002,322,432