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 listMay 28, 2025 17:07T PrathamT PrathamScore: 34,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2025 17:0734,263309,689,680284,380,00002,289,664
2May 28, 2025 17:0734,263307,809,362284,381,00002,273,280
3May 28, 2025 17:0734,265311,254,005283,400,0001,001,0002,277,376
4May 28, 2025 17:0734,267310,754,627283,412,0001,001,0002,289,664
5May 28, 2025 17:0734,267310,216,818283,412,0001,001,0002,277,376
6May 28, 2025 17:0734,275308,038,114283,485,000998,0002,289,664
7May 28, 2025 17:0734,279311,289,553283,515,0001,001,0002,277,376
8May 28, 2025 17:0734,280314,107,860282,524,0001,996,0002,277,376
9May 28, 2025 17:0734,304311,692,657281,729,0002,997,0002,269,184