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 listOct 11, 2024 00:54Joad NacerJoad NacerScore: 6,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 00:546,40372,161,19951,142,0002,005,0002,306,048
2Oct 11, 2024 00:546,40677,155,59151,163,0002,006,0002,310,144
3Oct 11, 2024 00:546,41677,009,66751,242,0002,009,0002,314,240
4Oct 11, 2024 00:546,56381,522,64854,476,00002,330,624
5Oct 11, 2024 00:546,56477,657,05554,484,00002,314,240
6Oct 11, 2024 00:546,57785,173,18751,553,0003,032,0002,306,048