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 03:19Joad NacerJoad NacerScore: 4,742Success
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 03:194,65861,030,95337,644,0001,017,0002,334,720
2Oct 11, 2024 03:194,72166,704,78837,179,0002,009,0002,506,752
3Oct 11, 2024 03:194,72363,881,40037,193,0002,010,0002,506,752
4Oct 11, 2024 03:194,74262,415,13738,353,0001,009,0002,506,752
5Oct 11, 2024 03:194,81067,422,07238,926,000998,0002,334,720
6Oct 11, 2024 03:194,94064,383,16338,005,0003,000,0002,510,848