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 listSep 29, 2026 10:47wnwnScore: 3,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:483,26036,455,33327,061,000020,480
2Sep 29, 2026 10:483,27135,848,63927,150,000020,480
3Sep 29, 2026 10:483,30136,270,21227,400,000020,480
4Sep 29, 2026 10:483,30936,404,97527,470,000020,480
5Sep 29, 2026 10:483,36038,161,26127,888,000020,480
6Sep 29, 2026 10:483,42837,181,75328,459,000020,480
7Sep 29, 2026 10:483,47737,614,29828,867,000020,480
8Sep 29, 2026 10:483,48238,450,39028,907,000020,480
9Sep 29, 2026 10:483,51838,164,80929,207,000020,480