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 listApr 6, 2026 15:56Danylo MocherniukDanylo MocherniukScore: 6,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 15:566,24178,066,89049,808,0001,992,0002,437,120
2Apr 6, 2026 15:576,24679,018,87450,842,000996,0002,293,760
3Apr 6, 2026 15:576,25572,835,43549,917,0001,996,0002,519,040
4Apr 6, 2026 15:566,25778,025,61450,932,000998,0002,293,760
5Apr 6, 2026 15:566,26676,182,74550,004,0002,000,0002,420,736
6Apr 6, 2026 15:576,28574,047,55451,160,0001,003,0002,293,760
7Apr 6, 2026 15:576,28673,848,85850,171,0002,006,0002,293,760
8Apr 6, 2026 15:576,28878,165,36250,184,0002,007,0002,416,640
9Apr 6, 2026 15:566,29473,612,17151,237,0001,004,0002,293,760
10Apr 6, 2026 15:576,29580,632,31450,243,0002,009,0002,293,760
11Apr 6, 2026 15:566,29679,789,64251,249,0001,004,0002,293,760
12Apr 6, 2026 15:566,33680,784,96351,574,0001,011,0002,420,736