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 18, 2026 03:34Yuriy LyfenkoYuriy LyfenkoScore: 4,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 03:344,92464,667,46738,873,0001,993,0002,469,888
2Mar 18, 2026 03:344,93866,224,85638,984,0001,999,0002,306,048
3Mar 18, 2026 03:344,94272,605,74239,018,0002,000,0002,269,184