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 listMay 10, 2026 10:55wnwnScore: 4,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:564,11449,297,71733,091,0001,059,0002,490,368
2May 10, 2026 10:564,12048,273,94533,163,0001,039,0002,494,464
3May 10, 2026 10:564,12849,816,47233,163,0001,103,0002,486,272
4May 10, 2026 10:564,16350,002,43433,464,0001,096,0002,486,272
5May 10, 2026 10:564,41953,783,28235,604,0001,077,0002,494,464
6May 10, 2026 10:564,45154,308,01835,924,0001,022,0002,478,080
7May 10, 2026 10:564,45952,862,90535,919,0001,095,0002,494,464
8May 10, 2026 10:564,46451,393,66336,000,0001,056,0002,486,272
9May 10, 2026 10:564,47554,351,31336,061,0001,082,0002,478,080