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 22, 2026 21:38SneedSneedScore: 67,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 21:3867,519590,151,113559,407,0001,000,0002,277,376
2Feb 22, 2026 21:3867,780597,486,255561,575,000999,0002,277,376
3Feb 22, 2026 21:3867,800592,579,634561,745,000999,0002,531,328