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 listJun 4, 2025 06:05Abhigyan NiranjanAbhigyan NiranjanScore: 395,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 06:05394,4423,302,697,3013,198,895,00074,974,0002,281,472
2Jun 4, 2025 06:05394,5063,299,998,9133,209,428,00064,968,0002,510,848
3Jun 4, 2025 06:05394,5383,306,004,4833,198,697,00075,969,0002,289,664
4Jun 4, 2025 06:05395,3033,307,862,8993,228,050,00052,968,0002,506,752
5Jun 4, 2025 06:05395,3163,304,434,7843,228,150,00052,969,0002,289,664
6Jun 4, 2025 06:05395,6093,312,917,8613,204,587,00078,965,0002,285,568
7Jun 4, 2025 06:05395,9473,309,961,1183,211,396,00074,962,0002,502,656
8Jun 4, 2025 06:05397,1033,323,650,4953,224,998,00070,955,0002,289,664
9Jun 4, 2025 06:05398,4893,331,783,5993,238,488,00068,967,0002,506,752