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 10, 2026 09:54wnwnScore: 3,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 10, 2026 09:543,36244,191,45326,842,0001,068,0002,490,368
2May 10, 2026 09:543,38343,208,39027,033,0001,054,0002,486,272
3May 10, 2026 09:543,39342,923,57127,103,0001,067,0002,482,176
4May 10, 2026 09:543,54445,861,48828,339,0001,077,0002,490,368
5May 10, 2026 09:543,54844,580,97028,395,0001,058,0002,473,984
6May 10, 2026 09:543,54943,998,48828,369,0001,091,0002,482,176
7May 10, 2026 09:543,56045,338,29028,465,0001,085,0002,482,176
8May 10, 2026 09:543,57143,237,14328,560,0001,085,0002,486,272
9May 10, 2026 09:543,58645,464,62828,699,0001,068,0002,490,368