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 31, 2026 12:31Yuriy LyfenkoYuriy LyfenkoScore: 4,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 12:314,53464,983,66936,619,0001,017,0002,535,424
2Mar 31, 2026 12:314,66164,283,95737,667,0001,018,0002,273,280
3Mar 31, 2026 12:314,67867,332,99838,831,00002,535,424