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 listJan 2, 2026 18:11Josu San MartinJosu San MartinScore: 14,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 18:1111,102120,589,64090,147,0002,003,0002,285,568
2Jan 2, 2026 18:1111,102115,244,81391,149,0001,001,0002,387,968
3Jan 2, 2026 18:1111,119114,471,94292,288,00002,285,568
4Jan 2, 2026 18:1114,205143,942,204115,906,0001,998,0002,392,064
5Jan 2, 2026 18:1114,207142,992,533115,919,0001,998,0002,277,376
6Jan 2, 2026 18:1114,432148,507,273118,790,000998,0002,277,376