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 listNov 19, 2024 01:10zielajzielajScore: 3,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2024 01:103,54352,124,58929,404,00002,523,136
2Nov 19, 2024 01:103,55655,856,45628,496,0001,017,0002,359,296
3Nov 19, 2024 01:103,56151,011,41828,537,0001,019,0002,523,136
4Nov 19, 2024 01:103,68251,288,45630,559,00002,379,776
5Nov 19, 2024 01:103,69557,128,19329,646,0001,022,0002,527,232
6Nov 19, 2024 01:103,69963,115,87929,681,0001,023,0002,531,328