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 26, 2026 06:30poyo180605poyo180605Score: 112,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 06:30112,773962,272,689878,013,00058,000,0002,285,568
2Mar 26, 2026 06:30112,858960,344,486878,739,00057,982,0002,383,872
3Mar 26, 2026 06:30112,968962,815,509877,655,00059,976,0002,387,968