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 16, 2024 19:03zielajzielajScore: 3,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2024 19:033,57758,566,88729,687,00002,347,008
2Nov 16, 2024 19:033,61152,814,02327,972,0001,998,0002,523,136
3Nov 16, 2024 19:033,62350,942,31528,064,0002,004,0002,351,104
4Nov 16, 2024 19:033,77154,055,57429,283,0002,019,0002,531,328
5Nov 16, 2024 19:033,78452,131,99831,410,00002,437,120
6Nov 16, 2024 19:033,79253,633,34831,472,00002,277,376