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 2, 2026 11:57Andrey TsvetkovAndrey TsvetkovScore: 39,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:5939,225334,147,652323,432,0002,141,0002,138,112
2Aug 2, 2026 11:5939,231337,595,858323,492,0002,128,0002,138,112
3Aug 2, 2026 11:5939,241336,271,845323,569,0002,135,0002,138,112
4Aug 2, 2026 11:5939,243337,079,334323,600,0002,121,0002,138,112
5Aug 2, 2026 11:5939,245338,356,438323,550,0002,185,0002,138,112
6Aug 2, 2026 11:5939,254336,819,055323,602,0002,209,0002,138,112
7Aug 2, 2026 11:5939,258337,322,877323,646,0002,197,0002,138,112
8Aug 2, 2026 11:5939,258337,848,685323,614,0002,232,0002,138,112
9Aug 2, 2026 11:5939,281338,056,061324,023,0002,011,0002,138,112