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 listMar 15, 2026 19:30Ondřej PolaneckýOndřej PolaneckýScore: 62,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:3061,825536,384,264512,146,0001,000,0002,269,184
2Mar 15, 2026 19:3062,067536,257,696514,159,0001,000,0002,273,280
3Mar 15, 2026 19:3062,389538,281,184515,829,0001,999,0002,514,944