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 5, 2026 13:35wnwnScore: 3,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:353,64138,699,68229,223,0001,002,0002,113,536
2Sep 5, 2026 13:353,64338,700,12629,204,0001,036,0002,113,536
3Sep 5, 2026 13:353,64838,763,02929,281,0001,005,0002,113,536
4Sep 5, 2026 13:353,65038,731,88029,269,0001,032,0002,113,536
5Sep 5, 2026 13:353,65238,792,57729,233,0001,080,0002,113,536
6Sep 5, 2026 13:353,65638,837,19229,330,0001,021,0002,113,536
7Sep 5, 2026 13:353,81240,008,02830,629,0001,014,0002,113,536
8Sep 5, 2026 13:353,82040,160,79730,669,0001,040,0002,113,536
9Sep 5, 2026 13:353,82840,874,34330,771,0001,003,0002,113,536