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 02:06Joad NacerJoad NacerScore: 4,596Success
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 02:064,51360,221,94035,430,0002,024,0002,334,720
2Oct 11, 2024 02:064,52264,736,29135,504,0002,028,0002,510,848
3Oct 11, 2024 02:064,55464,340,95836,803,000994,0002,506,752
4Oct 11, 2024 02:064,59660,529,25436,138,0002,007,0002,506,752
5Oct 11, 2024 02:064,60958,849,85035,233,0003,020,0002,330,624
6Oct 11, 2024 02:064,61656,426,82135,285,0003,024,0002,330,624