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 listJul 2, 2026 17:56A_ShamanA_ShamanScore: 37,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 17:5637,350319,535,941307,999,0002,014,0002,113,536
2Jul 2, 2026 17:5637,351319,551,687309,012,0001,004,0002,113,536
3Jul 2, 2026 17:5637,354320,032,130309,038,0001,005,0002,113,536
4Jul 2, 2026 17:5637,356319,582,204309,056,0001,004,0002,113,536
5Jul 2, 2026 17:5637,356319,686,684308,048,0002,011,0002,113,536
6Jul 2, 2026 17:5637,358319,768,155309,071,0001,004,0002,113,536
7Jul 2, 2026 17:5637,371319,912,922308,177,0002,010,0002,113,536
8Jul 2, 2026 17:5637,380321,579,475309,255,0001,005,0002,113,536
9Jul 2, 2026 17:5637,388320,311,287309,318,0001,004,0002,113,536