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 24, 2026 03:11wnwnScore: 3,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:113,30336,130,08326,382,0001,036,0002,113,536
2Sep 24, 2026 03:113,31536,326,68627,518,000020,480
3Sep 24, 2026 03:113,32136,344,36826,560,0001,005,0002,113,536
4Sep 24, 2026 03:113,32236,305,86126,572,0001,003,0002,113,536
5Sep 24, 2026 03:113,33336,353,34826,585,0001,079,0002,113,536
6Sep 24, 2026 03:113,33536,495,41926,649,0001,035,0002,113,536
7Sep 24, 2026 03:113,44437,967,44628,592,000020,480
8Sep 24, 2026 03:113,45837,459,49427,672,0001,032,0002,113,536
9Sep 24, 2026 03:113,49238,436,00127,979,0001,010,0002,113,536