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 listApr 22, 2026 04:34wnwnScore: 3,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 04:343,66145,969,83029,380,0001,013,0002,322,432
2Apr 22, 2026 04:343,70154,291,83229,700,0001,024,0002,326,528
3Apr 22, 2026 04:343,70949,052,15228,806,0001,986,0002,383,872
4Apr 22, 2026 04:343,71947,267,24828,883,0001,991,0002,383,872
5Apr 22, 2026 04:343,73151,790,66028,977,0001,998,0002,379,776
6Apr 22, 2026 04:343,73448,283,77029,999,000999,0002,387,968
7Apr 22, 2026 04:343,75052,838,86729,121,0002,008,0002,383,872
8Apr 22, 2026 04:343,77945,844,32231,370,00002,383,872
9Apr 22, 2026 04:343,79449,950,58230,482,0001,016,0002,375,680