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 listFeb 24, 2026 20:59Mikołaj UzarskiMikołaj UzarskiScore: 5,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 20:595,32366,840,91942,170,0002,008,0002,510,848
2Feb 24, 2026 20:595,32572,932,50142,188,0002,008,0002,510,848
3Feb 24, 2026 20:595,32664,838,95942,193,0002,009,0002,498,560
4Feb 24, 2026 20:595,32971,243,94242,219,0002,010,0002,510,848
5Feb 24, 2026 20:595,33768,028,66642,281,0002,013,0002,277,376
6Feb 24, 2026 20:595,34068,300,21842,309,0002,014,0002,289,664
7Feb 24, 2026 20:595,36572,344,29242,503,0002,023,0002,277,376
8Feb 24, 2026 20:595,37973,224,92943,628,0001,014,0002,494,464
9Feb 24, 2026 20:595,38071,172,03843,639,0001,014,0002,498,560
10Feb 24, 2026 20:595,38076,336,58544,655,00002,514,944
11Feb 24, 2026 20:595,45568,809,15643,263,0002,012,0002,285,568
12Feb 24, 2026 20:595,49668,799,47943,591,0002,027,0002,281,472