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 listMay 3, 2026 20:34TudyMTudyMScore: 36,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:3736,034316,505,822298,085,0001,005,0002,379,776
2May 3, 2026 20:3736,045316,274,356298,171,0001,004,0002,379,776
3May 3, 2026 20:3736,058315,554,402298,282,0001,004,0002,379,776
4May 3, 2026 20:3736,059316,080,005298,287,0001,006,0002,383,872
5May 3, 2026 20:3736,061315,921,882298,303,0001,006,0002,367,488
6May 3, 2026 20:3736,063318,619,657298,318,0001,005,0002,375,680
7May 3, 2026 20:3736,066318,205,406298,346,0001,004,0002,379,776
8May 3, 2026 20:3736,068313,903,332298,359,0001,008,0002,363,392
9May 3, 2026 20:3736,079316,519,644298,453,0001,007,0002,383,872