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 24, 2026 16:49Ignas BagdonasIgnas BagdonasScore: 10,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 16:4910,398110,246,60285,298,0001,003,0002,293,760
2Mar 24, 2026 16:4910,399107,541,66085,307,0001,003,0002,293,760
3Mar 24, 2026 16:4910,400113,554,13884,314,0002,007,0002,293,760
4Mar 24, 2026 16:4910,400113,538,00684,317,0002,007,0002,293,760
5Mar 24, 2026 16:4910,402108,900,67384,327,0002,007,0002,265,088
6Mar 24, 2026 16:4910,405110,731,70584,351,0002,008,0002,293,760
7Mar 24, 2026 16:4910,410108,371,58885,395,0001,004,0002,293,760
8Mar 24, 2026 16:4910,423110,732,74585,509,0001,005,0002,289,664
9Mar 24, 2026 16:4910,428112,812,87785,543,0001,006,0002,293,760