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 15, 2024 19:31Elnur RakhmatullinElnur RakhmatullinScore: 58,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 19:3058,567514,431,681439,096,00047,010,0002,486,272
2Oct 15, 2024 19:3258,612515,468,490434,430,00052,051,0002,289,664
3Oct 15, 2024 19:3058,655508,689,071438,854,00047,984,0002,281,472
4Oct 15, 2024 19:3258,675510,450,549436,002,00051,000,0002,273,280
5Oct 15, 2024 19:3258,762518,158,118438,750,00048,972,0002,289,664
6Oct 15, 2024 19:3058,794510,881,816421,992,00065,998,0002,482,176
7Oct 15, 2024 19:3158,928512,563,365434,090,00055,011,0002,367,488
8Oct 15, 2024 19:3158,958517,891,047432,310,00057,040,0002,273,280
9Oct 15, 2024 19:3159,047512,892,291431,081,00059,011,0002,293,760