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 18, 2026 03:43wnwnScore: 9,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 03:439,298106,223,08675,172,0002,004,0002,293,760
2Apr 18, 2026 03:439,30199,096,63276,196,0001,002,0002,293,760
3Apr 18, 2026 03:4310,465111,235,77785,858,000998,0002,293,760