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 listOct 13, 2026 06:34e1011e1011Score: 751,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:35744,6916,191,685,6853,850,959,0002,329,980,0002,113,536
2Oct 13, 2026 06:35747,3616,214,634,9933,892,382,0002,310,715,0002,113,536
3Oct 13, 2026 06:35748,5206,223,436,9073,803,035,0002,409,683,0002,113,536
4Oct 13, 2026 06:35749,7256,233,849,5763,848,175,0002,374,548,0002,113,536
5Oct 13, 2026 06:35751,9886,252,606,3823,861,065,0002,380,443,0002,113,536
6Oct 13, 2026 06:35752,4966,256,375,5223,863,820,0002,381,901,0002,113,536
7Oct 13, 2026 06:35755,3426,280,601,3333,874,543,0002,394,802,0002,113,536
8Oct 13, 2026 06:35756,6226,290,681,6663,853,206,0002,426,762,0002,113,536
9Oct 13, 2026 06:35774,6906,440,648,4483,899,304,0002,530,624,0002,113,536