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 listAug 10, 2026 18:55Lan Hoang DaoLan Hoang DaoScore: 103,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 18:56103,086865,709,562797,831,00057,787,0002,113,536
2Aug 10, 2026 18:56103,089870,071,682796,980,00058,663,0002,113,536
3Aug 10, 2026 18:56103,112865,910,247796,966,00058,864,0002,113,536
4Aug 10, 2026 18:56103,133866,081,362797,940,00058,072,0002,113,536
5Aug 10, 2026 18:56103,138866,097,652797,143,00058,909,0002,113,536
6Aug 10, 2026 18:56103,162867,003,315796,851,00059,401,0002,113,536
7Aug 10, 2026 18:56103,163867,137,229797,928,00058,326,0002,113,536
8Aug 10, 2026 18:56103,166866,327,227797,748,00058,535,0002,113,536
9Aug 10, 2026 18:56103,214866,742,581797,726,00058,955,0002,113,536