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 10, 2024 22:27koenigskrautkoenigskrautScore: 140,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 22:27140,6461,194,616,8181,165,363,0001,998,0002,478,080
2Nov 10, 2024 22:27140,6491,189,142,6751,165,391,0001,998,0002,482,176
3Nov 10, 2024 22:27140,6681,187,492,6421,165,548,0001,999,0002,494,464
4Nov 10, 2024 22:27140,6881,188,079,4021,166,715,000999,0002,281,472
5Nov 10, 2024 22:27140,7021,198,139,2861,166,824,000999,0002,281,472
6Nov 10, 2024 22:27140,7101,190,123,3661,166,898,000999,0002,473,984
7Nov 10, 2024 22:27140,7831,193,890,5551,165,501,0002,998,0002,478,080
8Nov 10, 2024 22:27141,2751,199,469,1551,170,584,0001,999,0002,535,424
9Nov 10, 2024 22:27141,6331,199,228,4301,174,553,000999,0002,535,424