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 listFeb 1, 2026 16:13kkxkkxScore: 55,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2026 16:1355,442487,497,122402,149,00058,021,0002,277,376
2Feb 1, 2026 16:1355,488489,610,352407,603,00052,948,0002,277,376
3Feb 1, 2026 16:1355,514483,690,753397,797,00062,967,0002,383,872
4Feb 1, 2026 16:1355,573484,284,170405,222,00056,030,0002,387,968
5Feb 1, 2026 16:1355,614484,704,156399,649,00061,945,0002,277,376
6Feb 1, 2026 16:1355,623486,706,809401,712,00059,957,0002,273,280
7Feb 1, 2026 16:1355,625484,190,328398,729,00062,957,0002,277,376
8Feb 1, 2026 16:1355,729489,025,263399,610,00062,938,0002,277,376
9Feb 1, 2026 16:1355,860486,304,181405,680,00057,954,0002,490,368