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 listFeb 23, 2026 21:22Daniel MastalerzDaniel MastalerzScore: 5,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 21:225,56768,975,38245,200,0001,004,0002,281,472
2Feb 23, 2026 21:225,56969,818,37645,221,0001,004,0002,514,944
3Feb 23, 2026 21:225,59172,350,93944,390,0002,017,0002,490,368
4Feb 23, 2026 21:225,68575,155,55846,179,0001,003,0002,510,848
5Feb 23, 2026 21:225,68775,473,38045,190,0002,008,0002,506,752
6Feb 23, 2026 21:225,69069,860,20245,221,0002,009,0002,482,176