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 16:11E SequeiraE SequeiraScore: 19,054Success
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 16:1118,984185,540,175155,562,0002,007,0002,469,888
2Nov 10, 2024 16:1119,045188,058,469157,074,0001,000,0002,478,080
3Nov 10, 2024 16:1119,051181,806,617156,124,0002,001,0002,289,664
4Nov 10, 2024 16:1119,052186,181,836157,128,0001,000,0002,289,664
5Nov 10, 2024 16:1119,054187,314,478156,150,0002,001,0002,478,080
6Nov 10, 2024 16:1119,071181,327,844156,286,0002,003,0002,281,472
7Nov 10, 2024 16:1119,073188,688,999156,299,0002,003,0002,465,792
8Nov 10, 2024 16:1119,075184,783,464156,320,0002,004,0002,469,888
9Nov 10, 2024 16:1119,096187,169,669157,496,0001,003,0002,281,472