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:03T PrathamT PrathamScore: 34,496Success
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:0334,475310,012,856285,143,0001,000,0002,289,664
2May 28, 2025 17:0334,483312,525,692285,207,0001,000,0002,273,280
3May 28, 2025 17:0334,486313,160,380285,237,0001,000,0002,289,664
4May 28, 2025 17:0334,488306,752,633285,252,0001,000,0002,289,664
5May 28, 2025 17:0334,496307,972,048286,320,00002,269,184
6May 28, 2025 17:0334,497309,730,009286,325,00002,289,664
7May 28, 2025 17:0334,501308,372,064285,361,0001,001,0002,281,472
8May 28, 2025 17:0334,502312,182,032285,367,0001,001,0002,289,664
9May 28, 2025 17:0334,513314,809,435285,456,0001,001,0002,281,472