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 listJun 28, 2026 07:16Shikhar SoniShikhar SoniScore: 14,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 07:1614,299128,202,619115,264,0003,418,0002,113,536
2Jun 28, 2026 07:1614,356128,525,249115,698,0003,458,0002,113,536
3Jun 28, 2026 07:1614,371128,745,148116,253,0003,032,0002,113,536
4Jun 28, 2026 07:1614,401129,232,190116,082,0003,449,0002,113,536
5Jun 28, 2026 07:1614,415129,568,213116,629,0003,019,0002,113,536
6Jun 28, 2026 07:1614,533130,128,217117,196,0003,430,0002,113,536
7Jun 28, 2026 07:1614,668131,202,504118,735,0003,017,0002,113,536
8Jun 28, 2026 07:1614,728131,727,550119,189,0003,055,0002,113,536
9Jun 28, 2026 07:1614,922133,347,093120,411,0003,448,0002,113,536