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 10, 2026 18:58Sergey SerebryakovSergey SerebryakovScore: 7,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:587,58686,797,75860,963,0001,998,0002,265,088
2Mar 10, 2026 18:587,58785,766,63460,970,0001,999,0002,392,064
3Mar 10, 2026 18:587,59389,512,36861,025,0002,000,0002,396,160
4Mar 10, 2026 18:587,95486,712,55164,016,0002,000,0002,392,064
5Mar 10, 2026 18:587,95589,031,71064,023,0002,000,0002,265,088
6Mar 10, 2026 18:587,95788,710,87164,041,0002,001,0002,506,752