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 listMay 9, 2025 19:03vahookvahookScore: 6,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2025 19:036,12078,023,70345,813,0004,979,0002,527,232
2May 9, 2025 19:036,12277,715,57245,833,0004,981,0002,404,352
3May 9, 2025 19:036,12475,446,01347,840,0002,990,0002,408,448
4May 9, 2025 19:036,12972,456,87047,877,0002,992,0002,527,232
5May 9, 2025 19:036,13079,811,51747,884,0002,992,0002,404,352
6May 9, 2025 19:036,14975,598,83647,033,0004,002,0002,527,232
7May 9, 2025 19:036,15474,194,22647,072,0004,006,0002,404,352
8May 9, 2025 19:036,16975,680,25447,184,0004,015,0002,527,232
9May 9, 2025 19:036,20072,250,13548,434,0003,027,0002,527,232
10May 9, 2025 19:036,20171,178,95149,447,0002,018,0002,527,232
11May 9, 2025 19:036,22076,334,35848,593,0003,037,0002,400,256
12May 9, 2025 19:036,28674,038,19146,157,0006,020,0002,527,232