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 listAug 17, 2025 06:44Ashish AhujaAshish AhujaScore: 15,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 06:2815,112153,321,167110,499,00014,932,0002,318,336
2Aug 16, 2025 23:4915,155152,833,347110,811,00014,974,0002,387,968
3Aug 16, 2025 23:4915,167150,982,408113,894,00011,988,0002,433,024
4Aug 17, 2025 06:2815,181152,846,229112,000,00014,000,0002,379,776
5Aug 17, 2025 06:4415,238156,674,500111,538,00014,938,0002,318,336
6Aug 17, 2025 06:2815,357155,024,245114,521,00012,945,0002,498,560
7Aug 17, 2025 06:4415,386156,109,734111,741,00015,963,0002,297,856
8Aug 17, 2025 06:4415,468157,306,183118,434,0009,952,0002,424,832
9Aug 16, 2025 23:4915,590159,108,261114,466,00014,930,0002,437,120