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 17, 2026 14:50Yuriy LyfenkoYuriy LyfenkoScore: 8,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:508,37895,513,01861,477,0008,062,0002,375,680
2Mar 17, 2026 14:508,40694,714,91257,811,00011,961,0002,482,176
3Mar 17, 2026 14:508,42095,851,94761,899,0007,986,0002,355,200