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 17, 2026 17:25Pranav MPranav MScore: 89,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 17:2688,960750,019,453680,016,00058,355,0002,113,536
2Sep 17, 2026 17:2689,067749,537,207680,542,00058,719,0002,113,536
3Sep 17, 2026 17:2689,075749,711,339680,037,00059,286,0002,113,536