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 listSep 21, 2026 16:57Genos0Genos0Score: 60,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:5760,623513,413,623501,980,0001,193,0002,113,536
2Sep 21, 2026 16:5760,631514,641,360501,983,0001,259,0002,113,536
3Sep 21, 2026 16:5760,642513,603,593502,078,0001,251,0002,113,536
4Sep 21, 2026 16:5760,647513,838,229502,372,0001,002,0002,113,536
5Sep 21, 2026 16:5760,660513,773,053502,273,0001,206,0002,113,536
6Sep 21, 2026 16:5760,672513,908,773502,385,0001,194,0002,113,536
7Sep 21, 2026 16:5760,680513,921,134502,609,0001,036,0002,113,536
8Sep 21, 2026 16:5760,698514,087,526502,601,0001,196,0002,113,536
9Sep 21, 2026 16:5760,724514,289,051502,817,0001,197,0002,113,536