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 20, 2026 23:15Nao MinamiNao MinamiScore: 44,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 23:1644,233378,768,196297,946,00069,189,0002,129,920
2Oct 20, 2026 23:1644,258378,809,604297,875,00069,473,0002,129,920
3Oct 20, 2026 23:1644,268378,859,333298,607,00068,820,0002,129,920
4Oct 20, 2026 23:1644,299379,110,020298,410,00069,275,0002,117,632
5Oct 20, 2026 23:1644,322379,301,677298,346,00069,527,0002,129,920
6Oct 20, 2026 23:1644,336379,494,669298,903,00069,094,0002,129,920
7Oct 20, 2026 23:1644,836383,511,407302,992,00069,147,0002,129,920
8Oct 20, 2026 23:1644,843383,682,933303,739,00068,460,0002,129,920
9Oct 20, 2026 23:1644,895384,019,764303,742,00068,891,0002,129,920