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 22, 2026 13:36SneedSneedScore: 81,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 13:3681,000702,598,485576,261,00096,043,0002,289,664
2Feb 22, 2026 13:3681,078695,192,352596,957,00075,994,0002,281,472
3Feb 22, 2026 13:3681,159697,718,327590,667,00082,953,0002,289,664