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:57Joad NacerJoad NacerScore: 6,409Success
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:576,30882,670,55749,339,0003,020,0002,334,720
2Oct 11, 2024 00:576,32475,318,42749,461,0003,028,0002,334,720
3Oct 11, 2024 00:576,36376,263,75450,822,0001,993,0002,334,720
4Oct 11, 2024 00:576,40974,984,08251,184,0002,007,0002,330,624
5Oct 11, 2024 00:576,41774,407,80551,254,0002,009,0002,519,040
6Oct 11, 2024 00:576,45380,860,10851,543,0002,021,0002,330,624