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 13, 2024 23:56Joad NacerJoad NacerScore: 4,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 23:564,49665,469,11734,289,0003,025,0002,273,280
2Oct 13, 2024 23:564,57860,751,14536,999,000999,0002,301,952
3Oct 13, 2024 23:564,61358,563,91635,263,0003,022,0002,387,968
4Oct 13, 2024 23:564,68163,442,10038,853,00002,310,144
5Oct 13, 2024 23:564,68368,345,12036,872,0001,993,0002,531,328
6Oct 13, 2024 23:564,76764,396,67938,555,0001,014,0002,301,952