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 listFeb 19, 2026 20:35wnwnScore: 5,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 20:365,06764,993,75640,053,0002,002,0002,277,376
2Feb 19, 2026 20:365,07163,353,31340,089,0002,004,0002,277,376
3Feb 19, 2026 20:365,07365,408,92140,104,0002,005,0002,277,376
4Feb 19, 2026 20:365,07363,607,03240,101,0002,005,0002,490,368
5Feb 19, 2026 20:355,08165,768,79340,166,0002,008,0002,277,376
6Feb 19, 2026 20:365,08267,235,30440,171,0002,008,0002,277,376
7Feb 19, 2026 20:365,09565,631,79441,285,0001,006,0002,490,368
8Feb 19, 2026 20:365,11161,460,37641,414,0001,010,0002,277,376
9Feb 19, 2026 20:365,11470,190,58241,439,0001,010,0002,277,376
10Feb 19, 2026 20:365,12269,317,15141,501,0001,012,0002,277,376
11Feb 19, 2026 20:355,12974,304,53141,557,0001,013,0002,486,272
12Feb 19, 2026 20:355,13869,000,79841,633,0001,015,0002,486,272