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 10, 2024 23:28Joad NacerJoad NacerScore: 7,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 23:287,71892,436,22762,061,0002,001,0002,334,720
2Oct 10, 2024 23:287,73486,163,78261,184,0003,009,0002,334,720
3Oct 10, 2024 23:287,83286,656,82162,002,0003,000,0002,334,720
4Oct 10, 2024 23:287,89290,192,53164,494,0001,007,0002,322,432
5Oct 10, 2024 23:287,89395,267,13664,501,0001,007,0002,330,624
6Oct 10, 2024 23:287,90590,100,09263,622,0001,988,0002,330,624