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 14, 2024 12:59Igor ZyginIgor ZyginScore: 66,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 12:5965,833577,996,484484,479,00061,933,0002,269,184
2Nov 14, 2024 12:5965,949578,212,477484,446,00062,928,0002,289,664
3Nov 14, 2024 12:5966,119576,568,234485,815,00062,976,0002,289,664
4Nov 14, 2024 12:5966,172577,525,185483,320,00065,907,0002,269,184
5Nov 14, 2024 12:5966,222573,801,682484,685,00064,957,0002,281,472
6Nov 14, 2024 12:5966,310578,057,482488,446,00061,929,0002,281,472
7Nov 14, 2024 12:5966,370575,510,734489,883,00060,985,0002,289,664
8Nov 14, 2024 12:5966,557579,352,845483,493,00068,927,0002,289,664
9Nov 14, 2024 12:5966,563578,373,792476,543,00075,927,0002,273,280