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 6, 2026 19:54caandocaandoScore: 11,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 19:5410,990118,079,09389,212,0002,004,0002,269,184
2Mar 6, 2026 19:5410,990113,949,52589,217,0002,004,0002,269,184
3Mar 6, 2026 19:5411,043117,121,41690,654,0001,007,0002,519,040
4Mar 6, 2026 19:5411,859119,635,28698,433,00002,523,136
5Mar 6, 2026 19:5411,864126,161,92898,473,00002,281,472
6Mar 6, 2026 19:5411,866127,715,22498,487,00002,281,472