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 listOct 10, 2025 01:14MustafaMustafaScore: 70,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2025 01:1470,187607,748,090519,602,00062,951,0002,404,352
2Oct 10, 2025 01:1470,257609,156,189526,119,00057,012,0002,396,160
3Oct 10, 2025 01:1470,276610,209,696525,265,00058,029,0002,273,280
4Oct 10, 2025 01:1470,279608,682,890526,285,00057,030,0002,273,280
5Oct 10, 2025 01:1470,307610,553,124518,600,00064,949,0002,273,280
6Oct 10, 2025 01:1470,311605,792,306519,521,00064,064,0002,273,280
7Oct 10, 2025 01:1470,384610,806,009525,172,00059,019,0002,273,280
8Oct 10, 2025 01:1470,436611,291,895524,660,00059,961,0002,273,280
9Oct 10, 2025 01:1470,452610,794,405527,776,00056,975,0002,273,280