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 02:27zielajzielajScore: 3,716Success
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 02:273,61558,535,75028,007,0002,000,0002,342,912
2Nov 19, 2024 02:273,62250,129,29929,064,0001,002,0002,523,136
3Nov 19, 2024 02:273,64857,035,14728,258,0002,018,0002,527,232
4Nov 19, 2024 02:273,71659,512,18830,845,00002,359,296
5Nov 19, 2024 02:273,76152,310,67029,205,0002,014,0002,531,328
6Nov 19, 2024 02:273,76956,908,63329,263,0002,018,0002,269,184