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 listDec 29, 2025 11:16Aman | अमनAman | अमनScore: 54,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 11:1654,433477,752,705449,794,0001,999,0002,375,680
2Dec 29, 2025 11:1654,463481,713,941451,043,0001,000,0002,519,040
3Dec 29, 2025 11:1654,472481,014,843451,120,0001,000,0002,523,136
4Dec 29, 2025 11:1654,474481,221,786450,135,0002,000,0002,387,968
5Dec 29, 2025 11:1654,508476,528,417452,416,00002,387,968
6Dec 29, 2025 11:1654,510479,580,597452,437,00002,523,136
7Dec 29, 2025 11:1654,513482,308,947452,458,00002,392,064
8Dec 29, 2025 11:1654,513481,849,239451,456,0001,001,0002,387,968
9Dec 29, 2025 11:1654,542477,833,329450,697,0001,998,0002,260,992