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 listMar 27, 2026 17:43wnwnScore: 4,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 17:434,27656,162,31834,480,0001,014,0002,277,376
2Mar 27, 2026 17:434,29662,268,82534,642,0001,018,0002,498,560
3Mar 27, 2026 17:434,31962,319,23633,857,0001,991,0002,277,376