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 24, 2026 03:57wnwnScore: 3,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:573,73539,809,09327,112,0003,895,00020,480
2Sep 24, 2026 03:573,79940,228,23927,331,0004,206,0002,113,536
3Sep 24, 2026 03:573,80540,355,08727,146,0004,441,00020,480
4Sep 24, 2026 03:573,82740,603,12927,103,0004,666,00020,480
5Sep 24, 2026 03:573,89341,122,19428,146,0004,173,00020,480
6Sep 24, 2026 03:574,06442,511,45327,359,0006,379,0002,113,536
7Sep 24, 2026 03:574,14643,793,19528,645,0005,774,0002,113,536
8Sep 24, 2026 03:574,16343,317,46028,517,0006,040,00020,480
9Sep 24, 2026 03:574,22345,070,45128,803,0006,248,00020,480