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 listDec 26, 2025 19:13hunaphuhunaphuScore: 53,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 19:0953,487471,570,687384,949,00058,992,0002,273,280
2Dec 26, 2025 19:1353,487466,922,717384,951,00058,992,0002,392,064
3Dec 26, 2025 19:0953,504468,767,135387,070,00057,010,0002,404,352
4Dec 26, 2025 19:1353,594468,476,334386,852,00057,977,0002,519,040
5Dec 26, 2025 19:1353,694469,817,650385,704,00059,954,0002,400,256
6Dec 26, 2025 19:0953,719470,279,261386,884,00058,982,0002,428,928