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 listJan 3, 2026 15:43Carlos MGCarlos MGScore: 273,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 15:43273,0762,297,142,9372,151,607,000114,925,0002,433,024
2Jan 3, 2026 15:43273,3062,297,188,7832,166,508,000101,929,0002,330,624
3Jan 3, 2026 15:43273,3332,296,742,7542,176,715,00091,945,0002,330,624
4Jan 3, 2026 15:43273,3612,298,761,1882,168,947,00099,951,0002,420,736
5Jan 3, 2026 15:43273,5792,298,441,2742,178,761,00091,947,0002,330,624
6Jan 3, 2026 15:43273,6402,296,091,9382,182,246,00088,969,0002,424,832
7Jan 3, 2026 15:43273,6412,301,675,8342,171,252,00099,965,0002,330,624
8Jan 3, 2026 15:43273,6982,304,499,9992,174,753,00096,944,0002,330,624
9Jan 3, 2026 15:43274,2762,302,003,0032,168,563,000107,928,0002,330,624