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 listApr 26, 2026 15:48TudyMTudyMScore: 35,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:4835,537312,531,091291,961,0002,999,0002,318,336
2Apr 26, 2026 15:4835,548316,754,059293,050,0002,000,0002,379,776
3Apr 26, 2026 15:4835,548316,187,573293,051,0002,000,0002,392,064
4Apr 26, 2026 15:4835,562309,059,860294,170,0001,000,0002,379,776
5Apr 26, 2026 15:4835,576312,424,946294,283,0001,000,0002,314,240
6Apr 26, 2026 15:4835,578314,959,186293,302,0002,002,0002,392,064
7Apr 26, 2026 15:4835,578310,185,987293,298,0002,002,0002,306,048
8Apr 26, 2026 15:4835,590313,715,949293,400,0002,002,0002,383,872
9Apr 26, 2026 15:4835,593314,139,251294,426,0001,001,0002,383,872