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 15, 2026 09:51Tomislav TunkovicTomislav TunkovicScore: 5,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 09:515,05651,083,85740,932,0001,038,0002,117,632
2Aug 15, 2026 09:515,05650,420,47240,941,0001,032,0002,117,632
3Aug 15, 2026 09:515,05750,906,97040,959,0001,022,0002,117,632
4Aug 15, 2026 09:515,05750,464,95940,938,0001,038,0002,117,632
5Aug 15, 2026 09:515,05850,448,10940,942,0001,040,0002,117,632
6Aug 15, 2026 09:515,06150,496,49740,972,0001,036,0002,117,632
7Aug 15, 2026 09:515,06350,470,35740,987,0001,040,0002,117,632
8Aug 15, 2026 09:515,06850,787,98541,028,0001,041,0002,117,632
9Aug 15, 2026 09:515,08350,634,08641,150,0001,043,0002,117,632