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 listSep 29, 2026 11:05wnwnScore: 3,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 11:063,27735,849,97727,200,000020,480
2Sep 29, 2026 11:063,27935,963,14227,223,000020,480
3Sep 29, 2026 11:063,34636,604,44727,772,000020,480
4Sep 29, 2026 11:063,35436,619,44627,845,000020,480
5Sep 29, 2026 11:063,35436,602,38227,844,000020,480
6Sep 29, 2026 11:063,42437,182,80228,421,000020,480
7Sep 29, 2026 11:063,44437,320,59628,588,000020,480
8Sep 29, 2026 11:063,45438,160,22028,670,000020,480
9Sep 29, 2026 11:063,47137,690,78328,815,000020,480