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 listMar 8, 2026 17:05wnwnScore: 4,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 17:054,35757,072,29334,152,0002,008,0002,498,560
2Mar 8, 2026 17:054,36462,377,66634,206,0002,012,0002,502,656
3Mar 8, 2026 17:054,38356,940,56135,373,0001,010,0002,273,280
4Mar 8, 2026 17:054,38760,188,28835,401,0001,011,0002,490,368
5Mar 8, 2026 17:054,41265,038,67135,601,0001,017,0002,273,280
6Mar 8, 2026 17:054,43965,012,80734,851,0001,991,0002,494,464