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 listOct 5, 2026 02:19FrederickFrederickScore: 9,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:199,15187,124,29373,916,0002,044,0002,117,632
2Oct 5, 2026 02:199,26288,008,37274,855,0002,022,0002,117,632
3Oct 5, 2026 02:199,46589,095,89376,524,0002,041,0002,117,632
4Oct 5, 2026 02:199,48289,833,75876,648,0002,060,0002,117,632
5Oct 5, 2026 02:199,49389,544,66877,771,0001,022,0002,117,632
6Oct 5, 2026 02:199,50290,038,83876,839,0002,031,0002,117,632
7Oct 5, 2026 02:199,53590,390,91477,092,0002,053,0002,117,632
8Oct 5, 2026 02:199,58890,744,12377,552,0002,035,0002,117,632
9Oct 5, 2026 02:199,81192,599,63379,392,0002,046,0002,117,632