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 listNov 19, 2025 13:44PinKodPinKodScore: 271,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2025 13:44271,2782,281,812,0642,181,648,00069,956,0002,506,752
2Nov 19, 2025 13:44271,4442,281,346,4612,175,023,00077,964,0002,289,664
3Nov 19, 2025 13:44271,7532,283,847,1552,183,596,00071,953,0002,289,664
4Nov 19, 2025 13:44271,8122,281,866,7162,190,070,00065,972,0002,281,472
5Nov 19, 2025 13:44271,9112,288,326,7262,181,900,00074,962,0002,502,656
6Nov 19, 2025 13:44272,1222,286,219,2352,194,651,00063,960,0002,506,752
7Nov 19, 2025 13:44272,1312,285,292,8062,181,729,00076,955,0002,289,664
8Nov 19, 2025 13:44272,1322,282,850,8952,182,743,00075,956,0002,506,752
9Nov 19, 2025 13:44276,3192,322,049,0252,237,483,00055,962,0002,289,664