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 listMar 29, 2026 01:40zielajzielajScore: 3,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 01:403,43850,352,24827,514,0001,019,0002,265,088
2Mar 29, 2026 01:273,45752,617,59927,668,0001,024,0002,527,232
3Mar 29, 2026 01:273,47551,835,99726,854,0001,989,0002,523,136
4Mar 29, 2026 01:403,47754,498,36927,861,000995,0002,523,136
5Mar 29, 2026 01:403,52557,155,65528,249,0001,008,0002,269,184
6Mar 29, 2026 01:273,54050,419,34428,366,0001,013,0002,519,040