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 listFeb 19, 2026 03:09Josu San MartinJosu San MartinScore: 61,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 03:0961,178533,757,029505,776,0001,999,0002,400,256
2Feb 19, 2026 03:0961,181530,888,634506,807,000999,0002,277,376
3Feb 19, 2026 03:0961,187533,700,605506,851,000999,0002,277,376