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 listAug 16, 2026 19:14marko1597marko1597Score: 4,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 19:254,58746,499,04236,970,0001,108,0002,117,632
2Aug 16, 2026 19:254,59446,324,41537,015,0001,120,0002,117,632
3Aug 16, 2026 19:254,59946,514,32837,051,0001,121,0002,117,632
4Aug 16, 2026 19:254,61446,544,08737,179,0001,124,0002,117,632
5Aug 16, 2026 19:254,62046,651,58237,231,0001,117,0002,117,632
6Aug 16, 2026 19:254,65146,837,65337,476,0001,133,0002,117,632
7Aug 16, 2026 19:254,65747,083,14437,540,0001,115,0002,117,632
8Aug 16, 2026 19:254,66146,947,47137,557,0001,137,0002,117,632
9Aug 16, 2026 19:255,18351,339,18441,885,0001,142,0002,117,632