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 listMay 21, 2026 21:41M-RochatM-RochatScore: 7,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 21:417,82874,967,65462,919,0002,060,0002,113,536
2May 21, 2026 21:417,83775,142,78362,892,0002,157,0002,113,536
3May 21, 2026 21:417,86276,688,37063,214,0002,042,0002,113,536
4May 21, 2026 21:417,86477,171,78663,119,0002,160,0002,113,536
5May 21, 2026 21:417,87076,756,56263,255,0002,067,0002,113,536
6May 21, 2026 21:417,87877,363,33663,324,0002,068,0002,113,536
7May 21, 2026 21:417,89675,056,10763,426,0002,116,0002,113,536
8May 21, 2026 21:417,91577,927,96063,540,0002,160,0002,113,536
9May 21, 2026 21:417,93375,769,75663,683,0002,162,0002,113,536