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 17, 2026 15:00Yuriy LyfenkoYuriy LyfenkoScore: 8,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 15:008,61997,466,71164,488,0007,053,0002,277,376
2Mar 17, 2026 15:008,65095,512,97362,819,0008,974,0002,273,280
3Mar 17, 2026 15:008,679103,515,05862,034,00010,005,0002,473,984