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 8, 2025 08:38luckyhwanluckyhwanScore: 412,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 08:38411,7873,441,861,2373,346,857,00070,975,0002,289,664
2Dec 8, 2025 08:38411,8363,447,839,5463,359,272,00058,969,0002,281,472
3Dec 8, 2025 08:38411,8423,447,960,5023,349,325,00068,965,0002,281,472
4Dec 8, 2025 08:38411,9423,445,415,9673,341,160,00077,957,0002,289,664
5Dec 8, 2025 08:38412,0043,442,483,3713,342,663,00076,969,0002,289,664
6Dec 8, 2025 08:38412,1383,449,153,7023,353,768,00066,975,0002,281,472
7Dec 8, 2025 08:38415,8273,475,421,7453,377,398,00073,964,0002,506,752
8Dec 8, 2025 08:38416,5523,485,449,6623,385,417,00071,966,0002,506,752
9Dec 8, 2025 08:38428,5393,586,946,2193,509,902,00046,971,0002,289,664