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 20, 2025 20:20Adam FolwarcznyAdam FolwarcznyScore: 20,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2025 20:2019,928191,264,879164,401,0001,002,0002,437,120
2Aug 20, 2025 20:2019,934190,507,480164,450,0001,002,0002,445,312
3Aug 20, 2025 20:2019,935195,698,307164,456,0001,002,0002,269,184
4Aug 20, 2025 20:2019,936190,566,331164,469,0001,002,0002,449,408
5Aug 20, 2025 20:2020,222187,432,108165,848,0001,998,0002,437,120
6Aug 20, 2025 20:2020,223187,211,700165,853,0001,998,0002,269,184
7Aug 20, 2025 20:2020,232189,016,186165,929,0001,999,0002,269,184
8Aug 20, 2025 20:2020,238188,793,035165,973,0001,999,0002,531,328
9Aug 20, 2025 20:2020,252188,110,719166,090,0002,001,0002,531,328