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 9, 2024 00:103xcept3xceptScore: 265,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 00:10265,0952,223,961,8602,114,320,00085,972,0002,486,272
2Oct 9, 2024 00:10265,1522,226,027,4402,108,815,00091,948,0002,326,528
3Oct 9, 2024 00:10265,1572,226,085,8372,123,845,00076,958,0002,326,528
4Oct 9, 2024 00:10265,2302,236,722,3542,104,435,00096,974,0002,482,176
5Oct 9, 2024 00:10265,4362,236,658,9352,102,343,000100,776,0002,326,528
6Oct 9, 2024 00:10265,4852,230,998,2782,115,588,00087,941,0002,326,528
7Oct 9, 2024 00:10265,9322,232,061,3242,108,314,00098,920,0002,326,528
8Oct 9, 2024 00:10266,1692,246,479,0542,107,335,000101,871,0002,330,624
9Oct 9, 2024 00:10267,5622,263,149,6212,122,088,00098,678,0002,326,528