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 listApr 5, 2026 20:32wnwnScore: 4,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2026 20:324,28559,254,84834,547,0001,016,0002,277,376
2Apr 5, 2026 20:324,31863,009,69933,849,0001,991,0002,277,376
3Apr 5, 2026 20:324,31962,943,26333,855,0001,991,0002,486,272