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 21, 2026 16:03Juraj ZelmanJuraj ZelmanScore: 7,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 16:037,73686,784,27162,201,0002,006,0002,461,696
2Feb 21, 2026 16:037,73886,887,24763,225,0001,003,0002,371,584
3Feb 21, 2026 16:037,80891,710,55363,807,000996,0002,285,568
4Feb 21, 2026 16:037,84685,722,46464,123,0001,001,0002,363,392
5Feb 21, 2026 16:037,87190,216,37864,324,0001,005,0002,293,760
6Feb 21, 2026 16:037,87698,379,79864,366,0001,005,0002,293,760