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 listMar 18, 2026 01:44Yuriy LyfenkoYuriy LyfenkoScore: 5,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 01:445,96781,769,10347,503,0002,021,0002,297,856
2Mar 18, 2026 01:445,97271,686,24548,559,0001,011,0002,285,568
3Mar 18, 2026 01:446,00376,028,98447,831,0001,992,0002,408,448