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 7, 2026 19:02Benn TanBenn TanScore: 84,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 19:0284,658730,655,875700,663,0001,999,0002,273,280
2Feb 7, 2026 19:0284,676725,938,364701,810,000999,0002,392,064
3Feb 7, 2026 19:0284,911735,413,764703,760,000999,0002,269,184