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 10, 2026 08:55wnwnScore: 3,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 08:563,29535,171,60526,337,0001,014,0002,113,536
2Jul 10, 2026 08:563,30035,531,97626,347,0001,047,0002,113,536
3Jul 10, 2026 08:563,30635,541,09926,439,0001,003,0002,113,536
4Jul 10, 2026 08:563,31035,547,78426,471,0001,003,0002,113,536
5Jul 10, 2026 08:563,33035,490,26026,639,0001,004,0002,113,536
6Jul 10, 2026 08:563,37536,109,00926,948,0001,066,0002,113,536
7Jul 10, 2026 08:563,39636,043,20127,168,0001,024,0002,113,536
8Jul 10, 2026 08:563,42236,980,30827,395,0001,008,0002,113,536
9Jul 10, 2026 08:563,45737,246,59627,682,0001,012,0002,113,536