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 listOct 17, 2025 10:12RyogaRyogaScore: 2,066,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2025 10:122,064,24717,165,317,70917,058,288,00074,961,0002,277,376
2Oct 17, 2025 10:122,065,12817,176,173,72917,067,600,00072,964,0002,277,376
3Oct 17, 2025 10:122,065,79517,184,268,87117,079,138,00066,961,0002,277,376
4Oct 17, 2025 10:122,066,09617,177,436,11317,081,623,00066,971,0002,277,376
5Oct 17, 2025 10:122,066,77717,184,458,92317,099,277,00054,975,0002,289,664
6Oct 17, 2025 10:122,066,86617,190,408,18617,086,026,00068,963,0002,285,568
7Oct 17, 2025 10:122,067,13917,185,955,44217,095,284,00061,968,0002,277,376
8Oct 17, 2025 10:122,068,12717,203,615,42317,089,488,00075,962,0002,277,376
9Oct 17, 2025 10:122,087,33017,355,756,11517,240,878,00083,960,0002,277,376