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 listMar 31, 2026 09:14ArkadyRudenkoArkadyRudenkoScore: 2,068,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 09:142,067,89317,197,599,55317,104,539,00058,977,0002,281,472
2Mar 31, 2026 09:142,068,00517,199,726,76317,117,463,00046,979,0002,281,472
3Mar 31, 2026 09:142,068,64617,200,395,83917,117,784,00051,975,0002,281,472
4Mar 31, 2026 09:142,068,65417,204,111,34417,111,856,00057,975,0002,281,472
5Mar 31, 2026 09:142,068,76817,206,049,20017,105,806,00064,968,0002,281,472
6Mar 31, 2026 09:142,069,04517,205,236,80817,110,108,00062,967,0002,285,568
7Mar 31, 2026 09:142,070,10617,217,947,76917,110,917,00070,966,0002,281,472
8Mar 31, 2026 09:142,071,91617,230,477,24717,135,935,00060,967,0002,281,472
9Mar 31, 2026 09:142,111,49817,559,856,66317,453,465,00071,968,0002,289,664