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 6, 2026 00:40Karthik ReddyKarthik ReddyScore: 4,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 00:414,6033,047,283,61327,032,00011,178,00020,480
2Oct 6, 2026 00:414,6083,047,415,76026,868,00011,383,00020,480
3Oct 6, 2026 00:414,6113,047,438,67526,997,00011,275,00020,480
4Oct 6, 2026 00:414,8063,049,068,88526,767,00013,125,00020,480
5Oct 6, 2026 00:414,8353,049,329,07627,251,00012,881,00020,480
6Oct 6, 2026 00:414,8423,049,324,28827,214,00012,979,00020,480
7Oct 6, 2026 00:414,8693,049,502,18727,179,00013,237,00020,480
8Oct 6, 2026 00:414,8703,049,509,64826,794,00013,627,00020,480
9Oct 6, 2026 00:414,8813,049,597,20127,067,00013,451,00020,480